Vertex magic total labelings of 2-regular graphs
نویسندگان
چکیده
منابع مشابه
Vertex magic total labelings of 2-regular graphs
A vertex magic total (VMT) labeling of a graph G = (V,E) is a bijection from the set of vertices and edges to the set of integers defined by λ : V ∪E → {1, 2, . . . , |V | + |E|} so that for every x ∈ V , w(x) = λ(x)+ ∑ xy∈E λ(xy) = k, for some integer k. A VMT labeling is said to be a super VMT labeling if the vertices are labeled with the smallest possible integers, 1, 2, . . . , |V |. In thi...
متن کاملVertex-magic labelings of regular graphs II
Previously the first author has shown how to construct vertexmagic total labelings (VMTLs) for large families of regular graphs. The construction proceeds by successively adding arbitrary 2-factors to a regular graph of order n which possesses a strong VMTL, to produce a regular graph of the same order but larger size. In this paper, we exploit this construction method. We are able to show that...
متن کاملSuper Vertex-magic Total Labelings of Graphs
Let G be a finite simple graph with v vertices and e edges. A vertex-magic total labeling is a bijection λ from V (G)∪E(G) to the consecutive integers 1, 2, · · · , v+e with the property that for every x ∈ V (G), λ(x) + Σy∈N(x)λ(xy) = k for some constant k. Such a labeling is super if λ(V (G)) = {1, · · · , v}. We study some of the basic properties of such labelings, find some families of graph...
متن کاملVertex Magic Total Labelings of Complete Graphs
The study of graph labeling has focussed on finding classes of graphs which admits a particular type of labeling. In this paper we consider a particular class of graph which admits a vertex magic total labeling. The class we considered here is the class of complete graphs, Kn . A vertex magic labeling of a graph is a bijection which maps the vertices V and edges E to the integers from 1, 2, 3, ...
متن کاملVertex Magic Total Labelings of Graphs
A vertex magic total labeling of a graph with v vertices and e edges is de ned as a one to one map taking the vertices and edges onto the integers v e with the property that the sum of the label on a vertex and the labels on its incident edges is a constant independent of the choice of vertex Properties of these labelings are studied It is shown how to construct labelings for several families o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.06.022